Computing the radius of pointedness of a convex cone
نویسندگان
چکیده
Let Ξ(H) denote the set of all nonzero closed convex cones in a finite dimensional Hilbert space H. Consider this set equipped with the bounded Pompeiu-Hausdorff metric δ. The collection of all pointed cones forms an open set in the metric space (Ξ(H), δ). One possible way of measuring the degree of pointedness of a cone K is by evaluating the distance from K to the set of all nonpointed cones. The number ρ(K) obtained in this way is called the radius of pointedness of the cone K. The evaluation of this number is, in general, a very cumbersome task. In this note, we derive a simple formula for computing ρ(K), and we propose also a method for constructing a nonpointed cone at minimal distance from K. Our results apply to any cone K whose maximal angle does not exceed 120 degrees.
منابع مشابه
Antipodality in convex cones and distance to unpointedness
We provide a complete answer to the problem which consists in finding an unpointed convex cone lying at minimal bounded Pompeiu–Hausdorff distance from a pointed one. We give also a simple and useful characterization of the radius of pointedness of a convex cone. A corresponding characterization for the radius of solidity of a convex cone is then derived by using a duality argument. c © 2007 El...
متن کاملOn pairs of vectors achieving the maximal angle of a convex cone
In this paper we explore the concept of antipodality relative to a closed convex cone K ⊂ IRd. The problem under consideration is that of finding a pair of unit vectors in K achieving the maximal angle of the cone. We mention also a few words on the attainability of critical angles. By way of application of the general theory, we briefly discuss the problem of estimating the radius of pointedne...
متن کاملAxiomatization of the index of pointedness for closed convex cones
LetC(H) denote the class of closed convex cones in a Hilbert space H . One possible way of measuring the degree of pointedness of a cone K is by evaluating the distance from K to the set of all nonpointed cones. This approach has been explored in detail in a previous work of ours. We now go beyond this particular choice and set up an axiomatic background for addressing this issue. We define an ...
متن کاملAn Optimal Alternative Theorem and Applications to Mathematical Programming
Given a closed convex cone P with nonempty interior in a locally convex vector space, and a set A ⊂ Y , we provide various equivalences to the implication A ∩ (−int P ) = ∅ =⇒ co(A) ∩ (−int P ) = ∅, among them, to the pointedness of cone(A + int P ). This allows us to establish an optimal alternative theorem, suitable for vector optimization problems. In addition, we characterize the two-dimens...
متن کاملA cone theoretic Krein-Milman theorem in semitopological cones
In this paper, a Krein-Milman type theorem in $T_0$ semitopological cone is proved, in general. In fact, it is shown that in any locally convex $T_0$ semitopological cone, every convex compact saturated subset is the compact saturated convex hull of its extreme points, which improves the results of Larrecq.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 111 شماره
صفحات -
تاریخ انتشار 2008